A Feasible SQP Method with Superlinear Convergence for General Constrained Optimization
نویسندگان
چکیده
منابع مشابه
A stabilized SQP method: superlinear convergence
Regularized and stabilized sequential quadratic programming (SQP) methods are two classes of methods designed to resolve the numerical and theoretical difficulties associated with ill-posed or degenerate nonlinear optimization problems. Recently, a stabilized SQP method has been proposed that allows convergence to points satisfying certain secondorder KKT conditions (Report CCoM 13-04, Center f...
متن کاملA Superlinearly feasible SQP algorithm for Constrained Optimization
This paper is concerned with a Superlinearly feasible SQP algorithm algorithm for general constrained optimization. As compared with the existing SQP methods, it is necessary to solve equality constrained quadratic programming sub-problems at each iteration, which shows that the computational effort of the proposed algorithm is reduced further. Furthermore, under some mild assumptions, the algo...
متن کاملA Globally Convergent Stabilized Sqp Method: Superlinear Convergence
Regularized and stabilized sequential quadratic programming (SQP) methods are two classes of methods designed to resolve the numerical and theoretical difficulties associated with ill-posed or degenerate nonlinear optimization problems. Recently, a regularized SQP method has been proposed that allows convergence to points satisfying certain second-order KKT conditions (SIAM J. Optim., 23(4):198...
متن کاملOn the superlinear local convergence of a filter-SQP method
Transition to superlinear local convergence is shown for a modified version of the trust-region filter-SQP method for nonlinear programming introduced by Fletcher, Leyffer, and Toint [8]. Hereby, the original trust-region SQP-steps can be used without an additional second order correction. The main modification consists in using the Lagrangian function value instead of the objective function va...
متن کاملA Method for Constrained Multiobjective Optimization Based on SQP Techniques
We propose a method for constrained and unconstrained nonlinear multiobjective optimization problems that is based on an SQP-type approach. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving single-objective constrained optimization problems. These single-objective problems are derived as SQP problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2007
ISSN: 1812-5654
DOI: 10.3923/jas.2007.1422.1427